The Super Patalan Numbers
نویسنده
چکیده
We introduce the super Patalan numbers, a generalization of the super Catalan numbers in the sense of Gessel, and prove a number of properties analogous to those of the super Catalan numbers. The super Patalan numbers generalize the super Catalan numbers similarly to how the Patalan numbers generalize the Catalan numbers.
منابع مشابه
A new approach to rank the decision making units in presence of infeasibility in intuitionistic fuzzy environment
Data envelopment analysis (DEA) is a linear programming based methodology to determine the relative performance efficiencies of homogeneous decision making units (DMUs). In real world applications, some input and output datas do not possess crisp/fuzzy essence but they possess intuitionistic fuzzy (IF) essence. So, in this study, we develop an IF BCC (IFBCC) and an IF super efficiency BCC (IFSE...
متن کاملElements of the sets enumerated by super-Catalan numbers
As we know several people tried to get many structures for fine numbers (see [31, Sequence A000957]), while others on Catalan numbers (see [31, Sequence A000108]). Stanley [34,35] gave more than 130 Catalan structures while Deutsch and Shapiro [11] also discovered many settings for the Fine numbers. The structures for Fine numbers and Catalan numbers are intimately related from the list of Fine...
متن کامل2 9 Fe b 20 08 Unitary super perfect numbers ∗ †
We shall show that 9, 165 are all of the odd unitary super perfect numbers.
متن کاملSuper Ballot Numbers
The Catalan numbers C n = (2n)!/n! (n + 1)! are are well-known integers that arise in many combinatorial problems. The numbers 6(2n)!/n! (n + 2)!, 60(2n)!/n! (n + 3)!, and more generally (2r + 1)!/r! · (2n)!/n! (n + r + 1)! are also integers for all n. We study the properties of these numbers and of some analogous numbers that generalize the ballot numbers, which we call super ballot numbers.
متن کاملAn Algorithm for Accelerated Acquirement of Minimal Representation of Super-large Numbers
An algorithm for accelerated acquirement of minimal representation of super-large numbers was presented. The algorithm considers a new form of arithmetic, which was called arithmetic of qrepresentation of large range integers; which was based on the numbers of the generalized sequence of Fibonacci. The estimations of the complexity of the offered algorithms are presented.
متن کامل